Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizations of solution sets of cone-constrained convex programming problems

In this paper, we consider a type of cone-constrained convex program in finitedimensional space, and are interested in characterization of the solution set of this convex program with the help of the Lagrange multiplier. We establish necessary conditions for a feasible point being an optimal solution. Moreover, some necessary conditions and sufficient conditions are established which simplifies...

متن کامل

Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential

In convex programming, characterizations of the solution set in terms of the subdifferential have been investigated by Mangasarian. An invariance property of the subdifferential of the objective function is studied, and as a consequence, characterizations of the solution set by any solution point and any point in the relative interior of the solution set are given. In quasiconvex programming, h...

متن کامل

Characterizations of the Solution Sets of Generalized Convex Minimization Problems

In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.

متن کامل

Disjunctive Quasiconvex Programming and Other Nonconvex Problems

A disjunctive programming problem corresponds to the minimization of an objective function on a constraint set which is a union of sets, for example, min f (x) s.t. min j∈ J g j (x) ≤ 0 where the functions f and g j are real valued defined on a Banach space X and J is a (possibly infinite) index set. This class of problems has been introduced by Balas [4] in 1974 and then studied by many author...

متن کامل

Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets

In this paper, we consider constrained multicriteria continuous location problems in two-dimensional spaces. In the literature, the continuous multicriteria location problem in two-dimensional spaces has received special attention in the last years, although only particular instances of convex functions have been considered. Our approach only requires the functions to be strictly quasiconvex an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 2018

ISSN: 0022-3239,1573-2878

DOI: 10.1007/s10957-018-1379-1